Efficient geometrical parametrization for finite‐volume‐based reduced order methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Order Reduction by Geometrical Parametrization for Shape Optimization in Computational Fluid Dynamics‡

Shape Optimization problems governed by partial differential equations result from many applications in computational fluid dynamics; they involve the repetitive evaluation of outputs expressed as functionals of the field variables and usually imply big computational efforts. For this reason looking for computational efficiency in numerical methods and algorithms is mandatory. The interplay bet...

متن کامل

Geometrical Study of Matching Pursuit Parametrization

This paper studies the effect of discretizing the parametrization of a dictionary used for Matching Pursuit decompositions of signals. Our approach relies on viewing the continuously parametrized dictionary as an embedded manifold in the signal space on which the tools of differential (Riemannian) geometry can be applied. The main contribution of this paper is twofold. First, we prove that if a...

متن کامل

Computational Methods for Reduced Order Modeling

This paper deals with computer aided generation of reduced-order models for fast static and dynamic simulations of micro electromechanical systems. Following previous work, we present improved methods to reduce the computational effort of parameter extraction techniques, to consider multiple electrodes and the extension of analysing capabilities. A micromirror example will be used to demonstrat...

متن کامل

Reduced order methods for uncertainty quantification problems

This work provides a review on reduced order methods in solving uncertainty quantification problems. A quick introduction of the reduced order methods, including proper orthogonal decomposition and greedy reduced basis methods, are presented along with the essential components of general greedy algorithm, a posteriori error estimation and Offline-Online decomposition. More advanced reduced orde...

متن کامل

Variance-Reduced Second-Order Methods

In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and the non-smooth part is equipped with a simple proximal mapping. We propose a proximal stochastic second-order method, which is efficient and scalable. It in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal for Numerical Methods in Engineering

سال: 2020

ISSN: 0029-5981,1097-0207

DOI: 10.1002/nme.6324